Optimum linear coding in continuous-time communication systems with noisy side information at the decoder (Corresp.)

نویسندگان

  • Tangül Ü. Basar
  • Tamer Basar
چکیده

interval is taken as T s. A similar problem, but in discrete time, more, if there is an m such that Tableh(m)#Table',(Y) for every has been considered in [l] where the authors have proposed an ad hoc linear encoding-decoding scheme which does not Y, then II E,H and Table~(k)=Table~(Z). With the computer asymptotically achieve the known performance bound for the we found the tables and from them we found that &,H)= 1. case when the side information is transmitted noise-free. In a This was done finding an m6 for which Tabler(k)#TableF(l) whenever Tablei(k)=Tablei(l). In this way we found 8(H) and recent note [2] they have improved on this scheme by consider-concluded that 19(G,') = 0(HI') and therefore Gp = HF. There is ing the case when the transmitter can also use the side information , and have shown within this context the optimal linear one exception: Hf (the group for X4+X+ 1) has an extra scheme then achieves the said performance bound under noise-symmetry, that given by the transposition (i,j) where i, j are the free side information. In this correspondence, however, we ob-positions corresponding to the field elements 0, 1. This comes tain a solution for the continuous-time version of the problem from having a codeword with weight two in the dual code. with noisy side information at the receiver and show that our ACKNOWLEDGMENT optimal linear scheme asyptotically achieves the well-known performance bounds in the cases when i) the side information is The author wishes to thank the referees for their careful transmitted to the receiver noise-free, and ii) there is no side reading, comments, and suggestions which have helped greatly information. For the general case, the optimal linear encoder-in improving the presentation of these results. decoder transformations are obtained in closed form. In the next section we formulate the problem and give the REFERENCES solution in Section III. Section IV is devoted to a discussion of 111 E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, the asymptotic behavior of the communication system. 1968.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-rate quantization and transform coding with side information at the decoder

We extend high-rate quantization theory to Wyner-Ziv coding, i.e., lossy source coding with side information at the decoder. Ideal Slepian-Wolf coders are assumed, thus rates are conditional entropies of quantization indices given the side information. This theory is applied to the analysis of orthonormal block transforms for Wyner-Ziv coding. A formula for the optimal rate allocation and an ap...

متن کامل

Dependency channel model for transform domain Wyner-Ziv coding

Distributed video coding is a new video coding paradigm aimed at shifting the computational expensive motion estimation to the decoder. Side information is generated at the decoder as a prediction of the current frame. This creates a virtual dependency channel between the source video at the encoder and the side information at the decoder. Error correcting channel codes are used to correct the ...

متن کامل

Optimum Source Codec Design in Coded Systems and Its Application for Low-Bit-Rate Speech Transmission∗

A generalized algorithm for designing an optimum VQ source codec in systems with channel coding is presented. Based on an AWGN channel model, the algorithm derives the distribution of the channel decoder soft-output and substitutes it in the expression for the system end-to-end distortion. The VQ encoder/decoder pair is then optimized by minimizing this end-to-end distortion. For a Gauss-Markov...

متن کامل

Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1979